Functions for relative maximization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relative Profit Maximization and Bertrand Equilibrium with Convex Cost Functions

This study derives pure strategy Bertrand equilibria in a duopoly in which two firms produce a homogeneous good with convex cost functions and seek to maximize the weighted sum of their absolute and relative profits. The study shows that there exists a range of equilibrium prices in duopolistic equilibria. This range of equilibrium prices is narrower and lower than the range of equilibrium pric...

متن کامل

1 6 A ug 2 00 6 Functions for relative maximization

We introduce functions for relative maximization in a general context: the beta and alpha applications. After a systematic study concerning regularities, we investigate how to approximate certain values of these functions using periodic orbits. We establish yet that the differential of an alpha application dictates the asymptotic behavior of the optimal trajectories.

متن کامل

Relativistic Equilibrium Distribution by Relative Entropy Maximization

The equilibrium state of a relativistic gas has been calculated based on the maximum entropy principle. Though the relativistic equilibrium state was long believed to be the Jüttner distribution, a number of papers have been published in recent years proposing alternative equilibrium states. However, some of these papers do not pay enough attention to the covariance of distribution functions, r...

متن کامل

Maximization of Submodular Set Functions

In this technical report, we aim to give a simple yet detailed analysis of several various submodular maximization algorithms. We start from analyzing the classical greedy algorithm, firstly discussed by Nemhauser et al. (1978), that guarantees a tight bound for constrained maximization of monotonically submodular set functions. We then continue by discussing two randomized algorithms proposed ...

متن کامل

Maximization of Approximately Submodular Functions

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a submodular function break submodularity. Say that F is ε-approximately submodular if there exists a submodular function f such that (1−ε)f(S) ≤ F (S) ≤ (1+ε)f(S) for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Dynamical Systems

سال: 2007

ISSN: 1468-9367,1468-9375

DOI: 10.1080/14689360701582378